Homotopy operations in symplectic and orthogonal groups
نویسندگان
چکیده
منابع مشابه
Invariant Fields of Symplectic and Orthogonal Groups
The projective orthogonal and symplectic groups POn(F ) and PSpn(F ) have a natural action on the F vector space V ′ = Mn(F ) ⊕ . . . ⊕ Mn(F ). Here we assume F is an infinite field of characteristic not 2. If we assume there is more than one summand in V , then the invariant fields F (V )n and F (V )n are natural objects. They are, for example, the centers of generic algebras with the appropri...
متن کاملEigendistributions for Orthogonal Groups and Representations of Symplectic Groups
We consider the action of H = O(p, q) on the matrix space Mp+q,n(R). We study a certain orbit O of H in the null cone N ⊆ Mp+q,n(R) which supports an eigendistribution dνO for H . Using some identities of Capelli type developed in the Appendix, we determine the structure of G̃ = Sp(2n,R)∼-cyclic module generated by dνO under the oscillator representation of G̃ (the metaplectic cover of G = Sp(2n(...
متن کاملYang-Mills Integrals for Orthogonal, Symplectic and Exceptional Groups
We apply numerical and analytic techniques to the study of Yang-Mills integrals with orthogonal, symplectic and exceptional gauge symmetries. The main focus is on the supersymmetric integrals, which correspond essentially to the bulk part of the Witten index for susy quantum mechanical gauge theory. We evaluate these integrals for D = 4 and group rank up to three, using Monte Carlo methods. Our...
متن کاملDegree Graphs of Simple Orthogonal and Symplectic Groups
Let G be a finite group and let cd(G) be the set of irreducible ordinary character degrees of G. The degree graph of G is the graph ∆(G) whose set of vertices is the set of primes dividing degrees in cd(G), with an edge between primes p and q if pq divides some degree in cd(G). We determine the graph ∆(G) for the finite simple groups of types B`, C`, D` and D`; that is, for the simple orthogona...
متن کاملProbabilistic Recognition of Orthogonal and Symplectic Groups: Corrections
We propose a simple one sided Monte-Carlo algorithm to dis-tinguish, to any given degree of certainty, the symplectic group Cn(q) =PSp2n(q) from the orthogonal group Bn(q) = Ω2n+1(q) where q > 3 is oddand n and q are given. The algorithm does not use an order oracle and worksin polynomial, of n log q, time. This paper corrects an error in the previously published version of the<...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Kyoto Journal of Mathematics
سال: 1991
ISSN: 2156-2261
DOI: 10.1215/kjm/1250519900